-
1 primitive element mod p element of the finite field GF(p)
примитивный элемент конечного поля GF(p)
—
[[http://www.rfcmd.ru/glossword/1.8/index.php?a=index&d=23]]Тематики
EN
Англо-русский словарь нормативно-технической терминологии > primitive element mod p element of the finite field GF(p)
См. также в других словарях:
Finite field arithmetic — Arithmetic in a finite field is different from standard integer arithmetic. There are a limited number of elements in the finite field; all operations performed in the finite field result in an element within that field.While each finite field is … Wikipedia
Finite field — In abstract algebra, a finite field or Galois field (so named in honor of Évariste Galois) is a field that contains only finitely many elements. Finite fields are important in number theory, algebraic geometry, Galois theory, cryptography, and… … Wikipedia
Primitive recursive function — The primitive recursive functions are defined using primitive recursion and composition as central operations and are a strict subset of the recursive functions (recursive functions are also known as computable functions). The term was coined by… … Wikipedia
примитивный элемент конечного поля GF(p) — — [[http://www.rfcmd.ru/glossword/1.8/index.php?a=index d=23]] Тематики защита информации EN primitive element mod p element of the finite field GF(p) … Справочник технического переводчика
Cyclic code — In coding theory, cyclic codes are linear block error correcting codes that have convenient algebraic structures for efficient error detection and correction. Contents 1 Definition 2 Algebraic structure 3 Examples … Wikipedia
Group (mathematics) — This article covers basic notions. For advanced topics, see Group theory. The possible manipulations of this Rubik s Cube form a group. In mathematics, a group is an algebraic structure consisting of a set together with an operation that combines … Wikipedia
Prime number — Prime redirects here. For other uses, see Prime (disambiguation). A prime number (or a prime) is a natural number greater than 1 that has no positive divisors other than 1 and itself. A natural number greater than 1 that is not a prime number is… … Wikipedia
Trigonometry in Galois fields — In mathematics, the theory of quadratic extensions of finite fields supports analogies with trigonometry.The main motivation to deal with a finite field trigonometry is the power of the discrete transforms, which play an important role in… … Wikipedia
Splitting of prime ideals in Galois extensions — In mathematics, the interplay between the Galois group G of a Galois extension L of a number field K, and the way the prime ideals P of the ring of integers OK factorise as products of prime ideals of OL, provides one of the richest parts of… … Wikipedia
Oval (projective plane) — In mathematics, an oval in a projective plane is a set of points, no three collinear, such that there is a unique tangent line at each point (a tangent line is defined as a line meeting the point set at only one point, also known as a 1 secant).… … Wikipedia
Étale cohomology — In mathematics, the étale cohomology groups of an algebraic variety or scheme are algebraic analogues of the usual cohomology groups with finite coefficients of a topological space, introduced by Grothendieck in order to prove the Weil… … Wikipedia